Method for transmitting control information in wireless communication system and apparatus therefor

ABSTRACT

A method for transmitting information data by using a Reed-Muller coding scheme in a wireless communication system is disclosed. The method includes the steps of configuring a number of resource elements for transmitting the information data; dividing the information data to first information data and second information data if a bit size O of the information data is equal to or larger than a predetermined number; applying RM coding on each of the first information data and the second information data; concatenating the coded first information data and the coded second information data, and transmitting the concatenated data by using the predetermined number of resource elements, wherein a minimum value Q′ min  for the number of resource elements is defined by a sum of a minimum value Q′ min     —     1  for the number of resource elements corresponding to the first information data and a minimum value Q′ min     —     2  for the number of resource elements corresponding to the second information data.

CROSS-REFERENCE TO RELATED APPLICATIONS

Pursuant to 35 U.S.C. §119, this application claims the benefit ofearlier filing date and right of priority to Korean Patent ApplicationNo. 10-2011-0027553, filed on Mar. 28, 2011 and U.S. ProvisionalApplication Ser. Nos. 61/414,377, filed on Nov. 16, 2010, 61/413,934,filed on Nov. 15, 2010, 61/412,792, filed on Nov. 12, 2010, 61/409,960,filed on Nov. 4, 2010, 61/407,891, filed on Oct. 28, 2010, 61/406,562,filed on Oct. 25, 2010, 61/406,153, filed on Oct. 24, 2010, 61/392,486,filed on Oct. 13, 2010, 61/387,011, filed on Sep. 28, 2010, 61/376,996,filed on Aug. 25, 2010, 61/376,164, filed on Aug. 23, 2010, and61/375,288, filed on Aug. 20, 2010, the contents of which areincorporated by reference herein in their entirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a wireless communication system. And,more particularly, the present invention relates to a method fortransmitting control information in wireless communication system andapparatus therefor.

2. Discussion of the Related Art

In a mobile communication system, a user equipment may receiveinformation from a base station via downlink, and the user equipment mayalso transmit information via uplink. The information received ortransmitted by the user equipment includes data and diverse controlinformation. And, various physical channels may exist depending upon thetype and purpose of the information received or transmitted by the userequipment.

FIG. 1 illustrates physical channels that are used in a 3^(rd)Generation Partnership Project (3GPP) Long Term Evolution (LTE) system,which is an example of a mobile communication system and a generalsignal transmitting method using the same.

When a power of a user equipment is turned off and then turned back on,or when a user equipment newly enters (or accesses) a cell, the userequipment performs an initial cell search process, such as synchronizingitself with the base station in step S101. For this, the user equipmentmay receive a P-SCH (Primary Synchronization Channel) and an S-SCH(Secondary Synchronization Channel) from the base station so as to be insynchronization with the base station, and the user equipment may alsoacquire information, such as cell ID. Thereafter, the user equipment mayreceive a Physical Broadcast Channel so as to acquire broadcastinformation within the cell. Meanwhile, the user equipment may receiveDownlink Reference Signal (DL RS), in the step of initial cell search,so as to verify the downlink channel status.

The user equipment that has completed the initial cell search mayreceive a Physical Downlink Control Channel (PDCCH) and a PhysicalDownlink Shared Channel (PDSCH) based upon the Physical Downlink ControlChannel (PDCCH) information, in step S102, so as to acquire moredetailed system information.

Meanwhile, the user equipment that has not yet completed the initialcell search may perform a Random Access Procedure, such as in steps S103and S106 of a later process, so as to complete the access to the basestation. In order to do so, the user equipment transmits acharacteristic sequence through a Physical Random Access Channel (PRACH)as a preamble (S103), and then the user equipment may receive a responsemessage respective to the random access through the PDCCH and itsrespective PDSCH (S104). In case of a contention based random access,excluding the case of a handover, the user equipment may performContention Resolution Procedures, such as transmitting an additionalPhysical Random Access Channel (PRACH) (S105) and receiving a PhysicalDownlink Control Channel (PDCCH) and a Physical Downlink Shared Channel(PDSCH) corresponding to the PDCCH.

After performing the above-described procedures, the user equipment mayreceive a Physical Downlink Control Channel (PDCCH)/Physical DownlinkShared Channel (PDSCH) (S107), as a general uplink/downlink signaltransmission procedure, and may then perform Physical Uplink SharedChannel (PUSCH)/Physical Uplink Control Channel (PUCCH) transmission(S108).

FIG. 2 illustrates a signal processing procedure performed by the userequipment for transmitting uplink signals.

In order to transmit an uplink signal, a scrambling module 210 of theuser equipment may scramble a transmission signal by using a userequipment specific scrambling signal. Then, the scrambled signal isinputted to a modulation mapper 220 so as to be modulated to a complexsymbol by using a Binary Phase Shift Keying (BPSK) scheme, a QuadraturePhase Shift Keying (QPSK) scheme, or a 16 Quadrature AmplitudeModulation (16QAM) scheme, based upon a type of the transmission signaland/or a channel status. Afterwards, the modulated complex symbol isprocessed by a conversion precoder 230 and then inputted to a resourceelement mapper 240. Herein, the resource element mapper 240 may map thecomplex symbol to a time-frequency resource element, which is to be usedin the actual transmission. The processed signal may then pass throughan SC-FDMA signal generator 250 so as to be transmitted to the basestation through an antenna.

FIG. 3 illustrates a signal processing procedure performed by the basestation for transmitting downlink signals.

In a 3GPP LTE system, a base station may transmit one or more codewords. Accordingly, each of the one or more code words may be processedas a complex symbol by a scrambling module 301 and a modulation mapper302, just as described in the uplink of FIG. 2. Subsequently, each ofthe complex symbols may be mapped to a plurality of layers by a layermapper 303, and each layer may be multiplied by a predeterminedprecoding matrix, which is selected based upon the channel status, by aprecoding module 304, thereby being allocated to each transmissionantenna. Each of the processed transmission signals respective to anantenna is mapped to a time-frequency resource element, which is to beused in the actual transmission, by a respective resource element mapper305. Thereafter, each of the transmission processed signals passesthrough an Orthogonal Frequency Division Multiple Access (OFDM) signalgenerator 306 so as to be transmitted through each antenna.

In a mobile communication system, when the user equipment transmits asignal via uplink, a Peak-to-Average Ratio (PAPR) may be moredisadvantageous then when the base station performs transmission viadownlink. Therefore, as described above in association to FIG. 2 andFIG. 3, unlike the OFDMA scheme, which is used in downlink signaltransmission, the Single Carrier-Frequency Division Multiple Access(SC-FDMA) scheme is used in uplink signal transmissions.

FIG. 4 illustrates an SC-FDMA scheme for transmitting uplink signals andan OFDMA scheme for transmitting downlink signals in a mobilecommunication system.

Herein, a user equipment for uplink signal transmission and a basestation for downlink signal transmission are identical to one another inthat each of the user equipment and the base station includes aSerial-to-Parallel Converter 401, a subcarrier mapper 403, an M-pointIDFT module 404, and a Cyclic Prefix (CP) adding module 406.

However, the user equipment for transmitting signals by using theSC-FDMA scheme additionally includes a Parallel-to-Serial Converter 405and an N-point IDFT module 402. And, herein, the N-point IDFT module 402is configured to cancel a predetermined portion of an IDFT processinginfluence caused by the M-point IDFT module, so that the transmissionsignal can have a single carrier property. FIG. 5 illustrates afrequency-domain signal mapping method for satisfying a single carriercharacteristic within the frequency domain. In FIG. 5, (a) represents alocalized mapping method, and (b) represents a distributed mappingmethod. The localized mapping method is defined in the current 3GPP LTEsystem.

Meanwhile, description will now be made on a clustered SC-FDMA, whichcorresponds to a corrected form of the SC-FDMA. In sequentiallyperforming a subcarrier mapping process between the DFT process and theIFFT process, the clustered SC-FDMA divides DFT process output samplesinto sub-groups, so that an IFFT sample input unit can map eachsub-group to subcarrier regions, which are spaced apart from oneanother. And, in some cases, clustered SC-FDMA may include a filteringprocess and a cyclic extension process.

At this point, a sub-group may be referred to as a cluster, and cyclicextension refers to a process of inserting a guard interval, which islonger than a maximum delay spread of a channel, between consecutive (orcontiguous) symbols in order to prevent inter-symbol interference (ISI)while each subcarrier symbol is being transmitted through a multi-pathchannel.

SUMMARY OF THE INVENTION

Accordingly, the present invention is directed to a method fortransmitting control information in a wireless communication system in awireless communication system and an apparatus therefor thatsubstantially obviate one or more problems due to limitations anddisadvantages of the related art.

Additional advantages, objects, and features of the invention will beset forth in part in the description which follows and in part willbecome apparent to those having ordinary skill in the art uponexamination of the following or may be learned from practice of theinvention. The objectives and other advantages of the invention may berealized and attained by the structure particularly pointed out in thewritten description and claims hereof as well as the appended drawings.

To achieve these and other advantages and in accordance with the purposeof the present invention, as embodied and broadly described, in a methodfor transmitting information data by using a Reed-Muller (RM) codingscheme in a wireless communication system, a method for transmittinginformation data includes the steps of configuring a number of resourceelements for transmitting the information data, dividing the informationdata to first information data and second information data if a bit sizeO of the information data is equal to or larger than a predeterminednumber, applying RM coding on each of the first information data and thesecond information data, concatenating the coded first information dataand the coded second information data, and transmitting the concatenateddata by using the predetermined number of resource elements, wherein aminimum value Q′_(min) in for the number of resource elements is definedby a sum of a minimum value Q′_(min) _(—) ₁ for the number of resourceelements corresponding to the first information data and a minimum valueQ′_(min) _(—) ₂ for the number of resource elements corresponding to thesecond information data.

In another aspect of the present invention, in a transmitting apparatusof a wireless communication system, the transmitting apparatus includesa processor configured to calculate a number of resource elements fortransmitting information data, to divide the information data to firstinformation data and second information data if a bit size O of theinformation data is equal to or larger than a predetermined number, toapply RM coding on each of the first information data and the secondinformation data, and to concatenate the coded first information dataand the coded second information data, and a transmission moduleconfigured to transmit the concatenated data by using the predeterminednumber of resource elements, wherein a minimum value Q′_(min) for thenumber of resource elements is defined by a sum of a minimum valueQ′_(min) _(—) ₁ for the number of resource elements corresponding to thefirst information data and a minimum value Q′_(min) _(—) ₂ for thenumber of resource elements corresponding to the second informationdata.

Herein, the information data may correspond to UCI (Uplink ControlInformation), and the Uplink Control Information may be transmittedthrough a Physical Uplink Shared Channel (PUSCH). Also, thepredetermined number may correspond to 12 bits

Preferably, when the bit size O of the information data corresponds toan even number, the minimum value Q′_(min) _(—) ₁ for the number ofresource elements corresponding to the first information data and theminimum value Q′_(min) _(—) ₂ for the number of resource elementscorresponding to the second information data may be defined by usingEquation 1 shown below.

$\begin{matrix}{Q_{{\min\_}\; 1}^{\prime} = {Q_{{\min\_}\; 2}^{\prime} = \lceil \frac{2 \times \frac{O}{2}}{Q_{m}} \rceil}} & {\text{<}{Equation}\mspace{14mu} 1\text{>}}\end{matrix}$

-   -   (Herein, Q_(m) indicates a bit size per symbol according to a        modulation order.)

Additionally, when the bit size O of the information data corresponds toan odd number, the minimum value Q′_(min) _(—) ₁ for the number ofresource elements corresponding to the first information data and theminimum value Q′_(min) _(—) ₂ for the number of resource elementscorresponding to the second information data may be defined by usingEquation 2 shown below.

$\begin{matrix}{Q_{{\min\_}\; 1}^{\prime} = {{\lceil \frac{2 \times \frac{O + 1}{2}}{Q_{m}} \rceil\mspace{14mu}{and}\mspace{14mu} Q_{{\min\_}\; 2}^{\prime}} = \lceil \frac{2 \times \frac{O - 1}{2}}{Q_{m}} \rceil}} & {\text{<}{Equation}\mspace{14mu} 2\text{>}}\end{matrix}$

-   -   (Herein, Q_(m) indicates a bit size per symbol according to a        modulation order.)

In short, the minimum value Q′_(min) _(—) ₁ the number of resourceelements corresponding to the first information data and the minimumvalue Q′_(min) _(—) ₂ for the number of resource elements correspondingto the second information data may be defined by using Equation 3 shownbelow.

$\begin{matrix}{Q_{{\min\_}1}^{\prime} = {{\lceil \frac{2 \times \lceil \frac{O}{2} \rceil}{Q_{m}} \rceil\mspace{14mu}{and}\mspace{14mu} Q_{{\min\_}2}^{\prime}} = {\lceil \frac{2 \times ( {O - \lceil \frac{O}{2} \rceil} )}{Q_{m}} \rceil = \lceil \frac{2 \times \lfloor \frac{O}{2} \rfloor}{Q_{m}} \rceil}}} & \langle {{Equation}\mspace{14mu} 3} \rangle\end{matrix}$

-   -   (Herein, O indicates the bit size of the information data, and        Q_(m) indicates a bit size per symbol according to a modulation        order.)

It is to be understood that both the foregoing general description andthe following detailed description of the present invention areexemplary and explanatory and are intended to provide furtherexplanation of the invention as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the invention and are incorporated in and constitute apart of this application, illustrate embodiment(s) of the invention andtogether with the description serve to explain the principle of theinvention. In the drawings:

FIG. 1 illustrates physical channels that are used in a 3^(rd)Generation Partnership Project (3GPP) Long Term Evolution (LTE) system,which is an example of a mobile communication system and a generalsignal transmitting method using the same;

FIG. 2 illustrates a signal processing procedure performed by the userequipment for transmitting uplink signals;

FIG. 3 illustrates a signal processing procedure performed by the basestation for transmitting downlink signals;

FIG. 4 illustrates an SC-FDMA scheme for transmitting uplink signals andan OFDMA scheme for transmitting downlink signals in a mobilecommunication system;

FIG. 5 illustrates a frequency-domain signal mapping method forsatisfying a single carrier characteristic within the frequency domain;

FIG. 6 illustrates a signal processing procedure, wherein DFT processoutput samples are mapped to a single carrier, in a cluster SC-FDMAaccording to an embodiment of the present invention;

FIG. 7 and FIG. 8 respectively illustrate a signal processing procedure,wherein DFT process output samples are mapped to a multi-carrier, in acluster SC-FDMA according to an embodiment of the present invention;

FIG. 9 illustrates a signal processing procedure in a segment SC-FDMAsystem according to an embodiment of the present invention;

FIG. 10 illustrates a signal processing procedure for transmitting areference signal (hereinafter referred to as RS) via uplink;

FIG. 11 illustrates a subframe structure for transmitting an RS in caseof a normal cyclic prefix (CP);

FIG. 12 illustrates a subframe structure for transmitting an RS in caseof an extended cyclic prefix (CP);

FIG. 13 illustrates a block view showing a processing procedure of atransmission channel with respect to an uplink shared channel;

FIG. 14 illustrates a mapping method of a physical resource for uplinkdata and control channels;

FIG. 15 illustrates a flow chart showing a method for efficientlymultiplexing data and control channels within an uplink shared channel;

FIG. 16 illustrates a block view showing a method of generatingtransmission signals of data and control channels;

FIG. 17 illustrates a codeword to layer mapping method;

FIG. 18 illustrates a method of dividing information data into groups inorder to apply a dual RM coding scheme according to a second embodimentof the present invention;

FIG. 19 illustrates another method of dividing information data intogroups in order to apply a dual RM coding scheme according to a secondembodiment of the present invention;

FIG. 20 illustrates a coding chain for dual RM coding according to thesecond embodiment of the present invention; and

FIG. 21 illustrates a block view showing a structure of a communicationapparatus according to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to the preferred embodiments of thepresent invention, examples of which are illustrated in the accompanyingdrawings. The detailed description of the present invention is providedto facilitate the understanding of the configuration, operation, andother characteristics of the present invention provide a description ofan exemplary embodiment of the present invention. The followingembodiments of the present invention correspond to an exemplary systemhaving the technical features of the present invention applied therein.The description of the present invention will be made by using an IEEE802.16 system as the example of the present invention, for simplicity.However, this is merely exemplary, and, therefore, the present inventionmay be applied to diverse wireless communication systems included in a3^(rd) Generation Partnership Project (3GPP) system.

The specific terms used in the following description of the presentinvention are provided to facilitate the understanding of the presentinvention. And, therefore, without deviating from the technical scopeand spirit of the present invention, the usage of such specific termsmay also be varied to different forms.

FIG. 6 illustrates a signal processing procedure, wherein DFT processoutput samples are mapped to a single carrier, in a cluster SC-FDMAaccording to an embodiment of the present invention. Also, FIG. 7 andFIG. 8 respectively illustrate a signal processing procedure, whereinDFT process output samples are mapped to a multi-carrier, in a clusterSC-FDMA according to an embodiment of the present invention.

Herein, FIG. 6 corresponds to an example wherein cluster SC-FDMA isapplied in an intra-carrier. And, FIG. 7 and FIG. 8 correspond to anexample wherein cluster SC-FDMA is applied in an inter-carrier. Also,FIG. 7 represents a case where a signal is generated (or created)through a single IFFT block, when subcarrier spacing between neighboringcomponent carriers is aligned, while contiguous component carriers areallocated in a frequency domain. And, FIG. 8 represents a case where asignal is generated through multiple IFFT blocks, since componentcarriers are not adjacent to one another, while component carriers arenon-contiguously allocated in the frequency domain.

Segmented SC-FDMA refers to simply performing DFT spreading of theconventional SC-FDMA and extending a frequency subcarrier mappingconfiguration of the IFFT in accordance with a relation between the DFTand the IFFT having a one-to-one correspondence, when a number of IFFTsequal to a random number of DFTs is being applied. Herein, the segmentedSC-FDMA may also be referred to as NxSC-FDMA or NxDFT-s-OFDMA. In thedescription of the present invention, this will be collectively referredto as segmented SC-FDMA.

FIG. 9 illustrates a signal processing procedure in a segmented SC-FDMAsystem according to an embodiment of the present invention. As shown inFIG. 9, the segmented SC-FDMA process refers to a process of groupingthe entire time domain modulation symbols to N number of groups (whereinN is an integer greater than 1) and performing a DFT process in groupunits, in order to alleviate the single carrier property condition (orspecification).

FIG. 10 illustrates a signal processing procedure for transmitting areference signal (hereinafter referred to as RS) via uplink. As shown inFIG. 10, data generate a signal from the time domain and processed withfrequency mapping through a DFT precoder, so as to be transmittedthrough the IFFT. Conversely, an RS bypasses the DFT precoder and isdirectly generated in the frequency domain (S11) and is transmittedafter being sequentially processed with localized mapping (S12) and IFFT(S13) processes and then processed with a cyclic prefix (CP) addingprocess (S14).

FIG. 11 illustrates a subframe structure for transmitting an RS in caseof a normal cyclic prefix (CP). And, FIG. 12 illustrates a subframestructure for transmitting an RS in case of an extended cyclic prefix(CP). Referring to FIG. 11, the RS is transmitted through 4^(th) and11^(th) OFDM symbols. And, referring to FIG. 12, the RS is transmittedthrough 3^(rd) and 9^(th) OFDM symbols.

Meanwhile, a processing structure of an uplink shared channel as atransmission channel will now be described as follows. FIG. 13illustrates a block view showing a processing procedure of atransmission channel with respect to an uplink shared channel. As shownin FIG. 13, data information that is multiplexed with controlinformation adds a TB-specific CRC (Cyclic Redundancy Check) to aTransport Block (hereinafter referred to as “TB”), which is to betransmitted via uplink (130). Then, depending upon a TB size, theprocessed transport block is divided into a plurality of Code blocks(hereinafter referred to as “CB”s), and CB-specific CRC is added to theplurality of CBs (131). Thereafter, channel coding is performed on theresulting value (132). Subsequently, the channel-coded data areprocessed with rate matching (133), and, then, a combination of the CBsis performed once again (134). Afterwards, the combined CBs aremultiplexed with a CQI/PMI (Channel Quality Information/Precoding MatrixIndex) (135).

Meanwhile, a channel coding process separate from that of the data isperformed on the CQI/PMI (136). Then, the channel-coded CQI/PMI ismultiplexed with the data (135).

Furthermore, a channel coding process separate from that of the data isalso performed on an RI (Rank Indication).

In case of an Acknowledgment/Negative Acknowledgment (ACK/NACK), achannel coding process separate from the channel coding processes of thedata, the CQI/PMI, and the RI is performed (138). The multiplexed dataand the CQI/PMI, the separately channel-coded RI, and the ACK/NACK areprocessed with channel interleaving, thereby generating an output signal(139).

Meanwhile, a detailed description will be made on physical resourceelements (hereinafter referred to as “RE”s) for data and controlinformation, in an LTE uplink system.

FIG. 14 illustrates a mapping method of a physical resource for uplinkdata and control channels.

As shown in FIG. 14, the CQI/PMI and the data are mapped on an RE in atime-first method. The coded ACK/NACK are punctured and inserted in thesurroundings of a demodulation reference signal (DM RS), and the RI ismapped to an RE positioned next to the RE having the ACK/NACK insertedtherein. Resources for the RI and the ACK/NACK may occupy a maximum of 4SC-FDMA symbols. In case data and control information are simultaneouslytransmitted to an uplink shared channel, the mapping order maycorrespond to an order of the RI, a concatenation of the CQI/PMI and thedata, and the ACK/NACK. More specifically, the RI is first mapped, andthen the concatenation of the CQI/PMI and the data are mapped to theremaining REs, excluding the RE having the RI mapped thereto, by usingthe time-first method. The ACK/NACK is mapped by puncturing theconcatenation of the CQI/PMI and the data, which are already mapped tothe respective REs.

As described above, by multiplexing the data and uplink controlinformation (UCI), such as the CQI/PMI and so on, the single carrierproperty may be satisfied. Therefore, an uplink transmission maintaininga low Cubic Metric (CM) may be achieved.

In an enhanced system of the conventional system (e.g., LTE Rel-10),with respect to each user equipment, among the two transmission methodsof the SC-FDMA and the cluster DFTs OFDMA within each carrier component,at least one transmission method may be applied for uplink transmission.And, the applied transmission method may be applied along with anUplink-MIMO (UL-MIMO) transmission.

FIG. 15 illustrates a flow chart showing a method for efficientlymultiplexing data and control channels within an uplink shared channel.

As shown in FIG. 15, the user equipment recognizes a rank of datarespective to a Physical Uplink Shared Channel (PUSCH) (S150). Then, theuser equipment configures a rank of an uplink control channel (herein, acontrol channel refers to Uplink Control Information (UCI), such as CQI,ACK/NACK, RI, and so on) to be identical to the rank of the data (S151).Also, the user equipment multiplexes data and control information(S152). Subsequently, after mapping the data and the CQI by using atime-first method, channel interleaving may be performed so as to mapthe RI to a designated RE and to map the ACK/NACK by puncturing the REssurrounding the DM-RS (S153).

Thereafter, the data and the control channel may be modulated to QPSK,16QAM, 64QAM, and so on in accordance with an MCS table (S154). At thispoint, the modulation step may be moved (or shifted) to anotherposition. (For example, the modulation block may be moved (or shifted)to a position prior to the multiplexing step of the data and the controlchannel.) Furthermore, channel interleaving may either be performed incode word units or be performed in layer units.

FIG. 16 illustrates a block view showing a method of generatingtransmission signals of data and control channels.

Assuming that there are two code words, channel coding is performed oneach code word (160), and rate matching is performed based upon a givenMCS level and resource size (161). Thereafter, coded bits may bescrambled by using a cell-specific method, a UE-specific method or acodeword-specific method (162).

Subsequently, a codeword to layer mapping is performed (163). Duringthis process, operations of a layer shift or permutation may beincluded.

FIG. 17 illustrates a codeword to layer mapping method. The codeword tolayer mapping may be performed by using the rule shown in FIG. 17. Theprecoding position shown in FIG. 17 may be different from the precodingposition shown in FIG. 13.

Control information, such as CQI, RI, and ACK/NACK, is channel codedbased upon a given specification (165). At this point, the CQI, the RI,and the ACK/NACK may be coded by using the same channel code for allcodewords or may be coded by using different channel codes for eachcodeword.

Thereafter, a number of coded bits may be varied by a bit-sizecontroller (166). The bit-size controller may form a single body withthe channel coding block (165). A signal outputted from the bit-sizecontroller is scrambled (167). At this point, scrambling may beperformed to be cell-specific, layer-specific, codeword-specific, orUE-specific.

The bit-size controller may perform the following operations.

(1) The controller recognizes a rank of data respective to PUSCH(n_rank_pusch).

(2) A rank of the control channel (n_rank_control) is configured to beidentical as the rank of the data (i.e., n_rank_control=n_rank_pusch),and a number of bits respective to the control channel is multiplied bythe control channel rank, thereby extending the number of bits.

One of the methods of performing the above-described operation is tosimply duplicate and repeat the control channel. At this point, thecontrol channel may either correspond to an information level prior tobeing processed with channel coding or correspond to a coded bit levelafter being processed with channel coding. More specifically, forexample, in case of a control channel [a0, a1, a2, a3] havingn_bit_crtl=4, and when n_rank_pusch=2, a number of extended bits(n_ext_crtl) may become 8 bits [a0, a1, a2, a3, a0, a1, a2, a3].

In case the bit-size controller and the channel coding unit areconfigured as a single body, the coded bits may be generated by adoptingchannel coding and rate matching, which are defined in the conventionalsystem (e.g., LTE Rel-8).

Additionally, in order to further provide randomization for each layer,a bit level interleaving process may be performed in the bit-sizecontroller. Alternatively, as an equivalent of the above, aninterleaving process may also be performed at a modulation symbol level.

A CQI/PMI channel and data respective to 2 codewords may be multiplexedby a data/control multiplexer (164). Then, by having the ACK/NACKinformation be mapped to REs surrounding the uplink DM-RS, in each slotwithin a subframe, the channel interleaver maps the CQI/PMI inaccordance with a time-first mapping method (168).

Then, modulation is performed for each layer (169), and DFT precoding(170), MIMO precoding (171), RE mapping (172), and so on, aresequentially performed. Thereafter, an SC-FDMA signal is generated andtransmitted through an antenna port (173).

The function blocks are not limited to the positions shown in FIG. 16.And, in some cases, the corresponding positioned may be changed. Forexample, the scrambling blocks 162 and 167 may be positioned after thechannel interleaving block. Also, the codeword to layer mapping block163 may be positioned after the channel interleaving block 168 or afterthe modulation mapper block 169.

The present invention proposes a channel coding method of a UCI and acorresponding resource allocation and transmission method of the samerespective to a case where the UCI, such as CQI, ACK/NACK, and RI, isbeing transmitted over the PUSCH. Although the description of thepresent invention is essentially based upon a transmission within anSU-MIMO environment, the present invention may also be applied to asingle antenna transmission, which may correspond to a particular caseof SU-MIMO.

In case the UCI and data currently corresponding to the SU-MIMO aretransmitted over the PUSCH, transmission may be performed by using thefollowing methods. Hereinafter, the position of the UCI within the PUSCHwill now be described.

The CQI is concatenated to the data and is mapped to remaining REs,excluding the RE having the RI mapped thereto, by using the time-firstmapping method and by using the same modulation order and constellationas the data. In case of the SU-MIMO, the CQI is transmitted by beingdispersed to one codeword, and, among the two codewords, the codeword towhich the CQI is transmitted corresponds to the codeword having a higherMCS level. And, in case the MCS levels of the two codewords are thesame, the CQI is transmitted to codeword 0. Also, the ACK/NACK ispositioned by puncturing a concatenation of the CQI and data, which arealready mapped to symbols located at each side of a reference signal.And, since the reference signal is positioned in 3^(rd) and 10^(th)symbols, the mapping process is performed by starting from the lowermostsubcarrier of 2^(nd), 4^(th), 9^(th), and 11^(th) symbols and proceedingupwards. At this point, the ACK/NACK symbol is mapped by an order the2^(nd), 11^(th), 9^(th), 4^(th) symbols. The RI is mapped to a symbolpositioned next to the ACK/NACK and is mapped earlier than any otherinformation (data, CQI, ACK/NACK) being transmitted to the PUSCH. Morespecifically, mapping of the RI is performed by starting from thelowermost subcarrier of 1^(st), 5^(th), 8^(th), and 12^(th) symbols andproceeding upwards. At this point, the RI symbol is mapped by an orderof the 1^(st), 12^(th), 8^(th), 5^(th) symbols. Most particularly, incase the information bit size is equal to 1 bit or 2 bits, the ACK/NACKand the RI are mapped by using only four corners of the constellationand by using the QPSK method. And, in case the information bit size isequal to or larger than 3 bits, the ACK/NACK and the RI may be mapped byusing all constellations of the modulation order identical to that ofthe data. Furthermore, the ACK/NACK and the RI uses the same resourcescorresponding to the same position within each layer so as to transmitthe same information.

Hereinafter, a method for calculating a number of resource elements forthe UCI within the PUSCH will now be described. First of all, the numberof resource elements for the CQI and the ACK/NACK (or RI), which arebeing transmitted within the PUSCH, may be respectively calculated byusing Equation 1 and Equation 2 shown below.

$\begin{matrix}{Q^{\prime} = {\min( {{\lceil \frac{\begin{matrix}{( {O + L} ) \cdot M_{sc}^{{PUSCH} - {initial}} \cdot} \\{N_{symb}^{{PUSCH} - {initial}} \cdot \beta_{offset}^{PUSCH}}\end{matrix}}{\sum\limits_{r = 0}^{C^{(x)} - 1}K_{r}^{(x)}} \rceil,M_{sc}^{PUSCH}}{{\cdot N_{symb}^{PUSCH}} - \frac{Q_{RI}}{Q_{m}}}} )}} & \lbrack {{Equation}\mspace{14mu} 1} \rbrack \\{Q^{\prime} = {\min\begin{pmatrix}{\lceil \frac{\begin{matrix}{O \cdot M_{sc}^{{PUSCH} - {{initial}{(1)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(1)}}} \cdot} \\{M_{sc}^{{PUSCH} - {{initial}{(2)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(2)}}} \cdot \beta_{offset}^{PUSCH}}\end{matrix}}{\begin{matrix}{{\sum\limits_{r = 0}^{C^{(1)} - 1}{K_{r}^{(1)} \cdot M_{sc}^{{PUSCH} - {{initial}{(2)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(2)}}}}} +} \\{\sum\limits_{r = 0}^{C^{(2)} - 1}{K_{r}^{(2)} \cdot M_{sc}^{{PUSCH} - {{initial}{(1)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(1)}}}}}\end{matrix}} \rceil,} \\{4 \cdot M_{sc}^{PUSCH}}\end{pmatrix}}} & \lbrack {{Equation}\mspace{14mu} 2} \rbrack\end{matrix}$

Herein, the number of resource elements for the CQI and the ACK/NACK (orRI) may also be expressed as a number of coded modulation symbols.

Hereinafter, a channel coding method for a UCI being transmitted withinthe PUSCH will now be described. First of all, in case of the CQI, whena payload size is equal to or below 11 bits, an RM (Reed-Muller) codingprocess using Table 1 shown below is applied to an input sequence (i.e.,information data) o₀, o₁, o₂, . . . , O_(O-1), so as to generate anoutput sequence of 32 bits. Also, in case a payload size of the CQIexceeds 11 bits, after adding an 8-bit CRC, a Tail biting convolutionalcoding (TBCC) method may be applied.

Meanwhile, a channel coding method for an ACK/NACK and an RI beingtransmitted within the PUSCH will now be described. If the informationdata size of the ACK/NACK and the RI is equal to 1 bit, i.e., if theinput sequence is [o₀ ^(UCI)], a channel coding process is performed inaccordance with the modulation order as shown in Table 2 below. Also, ifthe information data size of the ACK/NACK and the RI is equal to 2 bits,i.e., if the input sequence is [o₀ ^(UCI) o₁ ^(UCI)], a channel codingprocess is performed in accordance with the modulation order as shown inTable 3 below. Most particularly, referring to Table 3, o₀ ^(UCI)corresponds to the ACK/NACK or RI data for codeword 0, and o₁ ^(UCI)corresponds to the ACK/NACK or RI data for codeword 1, and o₂ ^(UCI)corresponds to (o₀ ^(UCI)+o₁ ^(UCI)) mod 2. More specifically, in Table2 and Table 3, x represents a value of 1, and y represents a repetitionof a previous value.

Alternatively, when the information data size of the ACK/NACK and the RIis within a range of 3 bits to 11 bits, the RM (Reed-Muller) codingmethod using Table 1 shown below may be applied, thereby generating anoutput sequence of 32 bits.

TABLE 1 i, 0 i, 1 i, 2 i, 3 i, 4 i, 5 i, 6 i, 7 i, 8 i, 9 i, 10 0 1 2 34 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1

TABLE 2 Q_(m) Encoded HARQ-ACK/RI 2 [o₀ ^(UCI) y] 4 [o₀ ^(UCI) y x x] 6[o₀ ^(UCI) y x x x x]

TABLE 3 Q_(m) Encoded HARQ-ACK/RI 2 [o₀ ^(UCI) o₁ ^(UCI) o₂ ^(UCI) o₀^(UCI) o₁ ^(UCI) o₂ ^(UCI)] 4 [o₀ ^(UCI) o₁ ^(UCI) x x o₂ ^(UCI) o₀^(UCI) x x o₁ ^(UCI) o₂ ^(UCI) x x] 6 [o₀ ^(UCI) o₁ ^(UCI) x x x x o₂^(UCI) o₀ ^(UCI) x x x x o₁ ^(UCI) o₂ ^(UCI) x x x x]

Most particularly, in case of performing the RM (Reed-Muller) codingprocess using Table 1, output data b₀, b₁, b₂, b₃, . . . b_(B-1), isexpressed as shown in Equation 3 below, and B=32.

$\begin{matrix}{b_{i} = {\sum\limits_{n = 0}^{O - 1}{( {o_{n} \cdot M_{i,n}} ){mod}\; 2}}} & \lbrack {{Equation}\mspace{14mu} 3} \rbrack\end{matrix}$

Finally, the UCI coded to B bits, i.e., the ACK/NACK or RI data mayperform rate matching in accordance with Equation 4 shown below, inorder to be mapped to Q′ number of resource elements, which iscalculated according to Equation 1 and Equation 2.q _(i) =b _(i mod B) , i=0,1, . . . ,Q _(m) ×Q′−1  [Equation 4]

The related art channel coding method is realized under the assumptionthat a single carrier environment is given. However, in case a multiplecarrier method is applied, as in the LTE-A system, since it is generallyknown that the UCI corresponding to each component carrier, i.e., theACK/NACK or RI data are combined by a component carrier order, the UCIsize may also increase in proportion to a number of aggregated componentcarriers. Most particularly, in case of the RI, the convention singlecarrier may have a maximum information data size of 3 bits. However, inan environment wherein 5 component carriers can be aggregated, themaximum information data size may be equal to 15 bits. Therefore, sincea maximum of 11 bits of information data can be coded by using thecurrently realized RM coding scheme, a new scheme (or method) capable ofdecoding the UCI in a multiple carrier environment is required.Hereinafter, a coding method and a rate matching method for each UCIsize will now be specifically proposed.

<First Embodiment—When the Information Data Size is Less than or Equalto 11 Bits>

In a single carrier environment and a multiple carrier environment,since RM coding is used, when the RI or ACK/NACK having the size of 3bits or more, the coded output data has a bit size of 32 bits. However,in case the channel status is excellent, and when the number of resourceelements is calculated by using Equation 1 and Equation 2, only anextremely small number of resource elements may be allocated based uponthe bit size of the information data. In this case, during the ratematching step, which is performed by using Equation 4, the codedcodewords may be excessively punctured due to the RM coding, therebycausing the performance to be degraded.

More specifically, in order to perform robust transmission regardless ofthe channel status, since the RI or ACK/NACK transmits codewords, whichare coded by the RI or ACK/NACK by using the RM coding scheme, by usingonly the constellation points of corner points, instead of using all ofthe constellations so as perform modulation, it is generally known thatonly 2 bits are mapped to a single resource element. Therefore, in orderto transmit all of the codewords coded to 32 bits, a total of 16resource elements are required. And, at this point, if the calculatednumber of resource elements is smaller than 16, puncturing may beperformed on the codewords as the rate matching process. However, whenperforming the puncturing process, a receiving end may determine theprocess as an error. Therefore, even if the codeword has a value of 16,which corresponds to the maximum value for the minimum distance betweencodes of the RM code, when puncturing a portion of the datacorresponding 4 symbols, the performance cannot be ensured. Also, sincethe puncturing process is sequentially performed in 2-bit units startingfrom the very last bit of the codeword, in order to maintain theperformance of the puncturing process, the degrading of the performancemay be increased. Hereinafter, as a first embodiment of the presentinvention, the present invention proposes a method for preventing suchdegrading of the performance caused by the above-described puncturingprocess.

1) When the ACK/NACK or RI has an information data size corresponding toa specific number of bits, i.e., when the ACK/NACK or RI corresponds toinformation data having a size equal to or larger than 3 bits, the firstembodiment of the present invention proposes a method of configuring aminimum value as the number of resource elements being allocated to theACK/NACK or RI. For example, when the information data size of theACK/NACK or RI is equal to or greater than 3 bits, the number ofresource elements allocated for transmitting the information data of theACK/NACK or RI is configured to be equal to a minimum number of 16 bits.Herein, it is preferable that the minimum value of the number ofresource elements, which is allocated to the ACK/NACK or RI, is equal toor greater than half the number of bits corresponding to the informationdata size. More specifically, the number of REs being allocated to theACK/NACK and the RI, i.e., the number of coded modulation symbols may becalculated by using Equation 6 and Equation 7 shown below.

$\begin{matrix}{Q^{\prime} = {\max( {Q_{\min}^{\prime},{\min( {{Q_{temp}^{\prime},4}{\cdot M_{sc}^{PUSCH}}} )}} )}} & \lbrack {{Equation}\mspace{14mu} 5} \rbrack \\{Q_{temp}^{\prime} = \lceil \frac{\begin{matrix}{O \cdot M_{sc}^{{PUSCH} - {{initial}{(1)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(1)}}} \cdot} \\{M_{sc}^{{PUSCH} - {{initial}{(2)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(2)}}} \cdot \beta_{offset}^{PUSCH}}\end{matrix}}{\begin{matrix}{{\sum\limits_{r = 0}^{C^{(1)} - 1}{K_{r}^{(1)} \cdot M_{sc}^{{PUSCH} - {{initial}{(2)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(2)}}}}} +} \\{\sum\limits_{r = 0}^{C^{(2)} - 1}{K_{r}^{(2)} \cdot M_{sc}^{{PUSCH} - {{initial}{(1)}}} \cdot N_{symb}^{{PUSCH} - {{initial}{(1)}}}}}\end{matrix}} \rceil} & \lbrack {{Equation}\mspace{14mu} 6} \rbrack\end{matrix}$

A minimum value Q′_(min) for the number of resource elements beingallocated to the ACK/NACK or RI may be decided according to Equation 7shown below.

$\begin{matrix}{Q_{\min}^{\prime} = \lceil \frac{2 \times O}{Q_{m}} \rceil} & \lbrack {{Equation}\mspace{14mu} 7} \rbrack\end{matrix}$

Herein, O represents a bit size of the information data of the ACK/NACKor RI, and Q_(m) corresponds to a bit size per symbol according to themodulation order. In case of the QPSK, Q_(m) is equal to 2, in case ofthe 16QAM, Q_(m) is equal to 4, and, in case of the 64QAM, Q_(m) isequal to 6.

Meanwhile, in case of the ACK/NACK and the RI, the standard of a codingrate for the RM coding process is ⅓. Accordingly, the minimum value forthe number of resource elements being allocated to the ACK/NACK or RImay be decided by using Equation 8 to Equation 10 shown below.

$\begin{matrix}{Q_{\min}^{\prime} = \lceil \frac{3 \times O}{Q_{m}} \rceil} & \lbrack {{Equation}\mspace{14mu} 8} \rbrack \\{Q_{\min}^{\prime} = {{\lceil {\frac{2 \times O}{Q_{m}} - \frac{1}{2}} \rceil\mspace{14mu}{or}\mspace{14mu} Q_{\min}^{\prime}} = \lceil \frac{{2 \times O} - {Q_{m}/2}}{Q_{m}} \rceil}} & \lbrack {{Equation}\mspace{14mu} 9} \rbrack \\{{Q_{\min}^{\prime} = {{\lceil {\frac{2 \times O}{Q_{m}} - \frac{3}{4}} \rceil\mspace{14mu}{or}\mspace{14mu} Q_{\min}^{\prime}} = \lceil \frac{{2 \times O} - ( {3{Q_{m}/4}} )}{Q_{m}} \rceil}}\mspace{14mu}} & \lbrack {{Equation}\mspace{14mu} 10} \rbrack\end{matrix}$

Table 4 to Table 7 shown below respectively correspond to examples ofcalculating the minimum value Q′_(min) for the number of resourceelements being allocated to the ACK/NACK or RI by using Equation 7 toEquation 10 presented above.

TABLE 4 Info. REs REs REs bit size for QPSK for 16QAM for 64QAM 3 3 2 14 4 2 2 5 5 3 2 6 6 3 2 7 7 4 3 8 8 4 3 9 9 5 3 10 10 5 4 11 11 6 4

TABLE 5 Info. REs REs REs bit size for QPSK for 16QAM for 64QAM 3 3 1 14 4 2 1 5 5 2 2 6 6 3 2 7 7 3 2 8 8 4 3 9 9 4 3 10 10 5 3 11 11 5 4

TABLE 6 Info. REs REs REs bit size for QPSK for 16QAM or 64QAM 3 5 3 2 46 3 2 5 8 4 3 6 9 5 3 7 11 6 4 8 12 6 4 9 14 7 5 10 15 8 5 11 17 9 6

TABLE 7 Info. REs for REs REs bit size QPSK for 16QAM for 64QAM 3 2 2 14 3 2 1 5 3 2 1 6 6 3 2 7 6 3 2 8 6 3 2 9 6 3 2 10 6 3 2 11 9 5 3

2) Also, in the first embodiment of the present invention, after theACK/NACK or RI codes the RM coding, when the ACK/NACK or RI is puncturedby the rate matching process, it may be considered to perform puncturingby a predetermined and specific order. More specifically, when theACK/NACK or RI is allocated to a given number of resource elements, theallocation order may be decided by grouping the ACK/NACK or RI in 1-bitor 2-bit units or in units of a specific number of bits, so that theACK/NACK or RI can be allocated to the resource elements by the decidedorder. For example, if the output data having the ACK/NACK or RI codedcorrespond to c₀, c₁, . . . , c₃₁, the output data are realigned througha permutation function π(i), i=0, 1, . . . , 31, which corresponds to apredetermined rule, so that an optimal performance can be demonstratedwhen performing the puncturing process. Then, in accordance with thepermuted order, the resource elements may be sequentially allocated, orthe puncturing process may be sequentially performed, by the index orderor by an inverse index order. More specifically, when 8 coded outputdata are allocated to the resource elements, the located data becomesc_(π(0)), c_(π(1)), . . . , c_(π(7)), instead of c₀, c₁, . . . , c₇.

3) Furthermore, according to the first embodiment of the presentinvention, different β_(offset) ^(PUSCH) values may be used dependingupon the information data size respective to the ACK/NACK and the RI.When puncturing the coded output data, i.e., the codeword by using theRM coding scheme, the influence of the puncturing process may varydepending upon the bit size of the information data. Therefore,depending upon the level of influence affecting the minimum distance ofthe codeword caused by the puncturing process, the β_(offset) ^(PUSCH)value may be configured differently. For example, when puncturing thecodeword, a comparatively large β_(offset) ^(PUSCH) value is set up forthe fastest bit size of the information data to have its minimumdistance value be equal to 0.

Although the above-described processes 1) to 3) describe the process ofsetting up the minimum value of the number of resource elements beingallocated to the UCI, in order to achieve the same object, a minimum bitsize value of the coded output data after processing rate matching mayalso be set up. More specifically, the minimum value Q′_(min) shown inEquation 5 may be configured in the number of resource elements as theminimum bit size value of the output data, as shown in Equation 11below.Q′ _(min)=2O  [Equation 11]

<Second Embodiment—When the Information Data Size is Equal to or Greaterthan 12 Bits>

In case the information data size of the ACK/NACK and the RI is equal toor greater than 12 bits, the PUSCH groups the information data to thesame bit size or to a different bit size, which corresponds to at leasttwo or more data sets. And, channel coding may be performed on each ofthe divided information data groups by using a (32,0) RM coding scheme,which is used in each PUSCH.

More specifically, when multiplexing the UCI, such as the RI orACK/NACK, and the data in a multiple carrier environment, theinformation data bits of the UCI are divided into at least two or moregroup, and each group may be coded as a single codeword. In this case,since a (32,0) RM coding scheme using Table 1 may be applied, when arange of the bit size of the information data is between 3 bits and 11bits, if the bit size of the information data included in each group isbetween 6 bits and 10 bits, then the (32,0) RM coding scheme, i.e., adual RM coding scheme may be applied for each group. Hereinafter, amethod for dividing the information data into group will first bedescribed, and then a method for calculating the number of resourceelements for allocating the coded information data and a method forperforming rate matching, i.e., a coding chain, when applying the dual(32,0) RM coding scheme, will be described afterwards. Thereafter, amethod for calculating a minimum number of resource elements that can beallocated for each codeword when applying the dual (32,0) RM codingscheme according to the first embodiment of the present invention willbe described.

1) Information Data Grouping Method when Performing Dual RM Coding

First of all, a method of dividing information data having the size of12 bits or more into groups in order to apply the dual (32,0) RM codingscheme will be described with reference to FIG. 18 and FIG. 19.

(1) FIG. 18 illustrates a method of dividing information data intogroups in order to apply a dual (32,0) RM coding scheme according to asecond embodiment of the present invention.

Referring to FIG. 18, the whole (or entire) information data may besequentially allocated as the input data of each encoder used for thedual (32,0) RM coding scheme. For example, when the 12-bit informationdata d₀, d₁, d₂, . . . , d₁₁ is coded by two RM encoders, theinformation data being inputted to a first RM encoder may correspond to6 bits d₀, d₂, d₄, . . . , d₁₀, which correspond to even-numberedinformation data bits. And, the information data being inputted to asecond (32,0) RM encoder may correspond to 6 bits d₁, d₃, d₅, . . . ,d₁₁, which correspond to odd-numbered information data bits.

More specifically, in case the given information data corresponds to o₀,o₁, o₂, . . . , o_(Q-1) among the input data of the RM encoder b₀, b₁,b₂, . . . , b_(Q-1), if b₀, b₁, b₂, . . . , b_(┌Q/2┐−1), and b_(┌Q/2┐),b_(┌Q/2┐+1), b_(┌Q/2┐+2), . . . , b_(Q-1) are respectively inputted tothe first RM encoder and the second RM encoder, when i is an evennumber, then b_(i/2)=o_(i). And, when i is an odd number thenb_(┌Q/2┐+(i+1)/2)=o_(i).

(2) FIG. 19 illustrates another method of dividing information data intogroups in order to apply a dual (32,0) RM coding scheme according to asecond embodiment of the present invention.

More specifically, in case the given information data corresponds to o₀,o₁, o₂, Λ , o_(Q-1) among the input data of the RM encoder b₀, b₁, b₂, Λ, b_(Q-1), if b₀, b₁, b₂, Λ , b_(┌Q/2┐−1), and b_(┌Q/2┐), b_(┌Q/2┐+1),b_(┌Q/2┐+2), Λ , b_(Q-1) are respectively inputted to the first RMencoder and the second RM encoder, when i is an even number, thenb_(i/2)=o_(i). And, when i is an odd number thenb_(┌Q/2┐+(i−1)/2)=o_(i).

Meanwhile, collectively referring to FIG. 18 and FIG. 19, when the bitsize O of the whole information data corresponds to an odd number,(O+1)/2 bits may be allocated as the information data being inputted tothe first RM encoder, and (O−1)/2 bits may be allocated as theinformation data being inputted to the second RM encoder. Alternatively,(O−1)/2 bits may be allocated as the information data being inputted tothe first RM encoder, and (O+1)/2 bits may be allocated as theinformation data being inputted to the second RM encoder.

(3) Among the component carriers, information data corresponding toprimary component carriers (primary CCs) may be configured as one group,and information data corresponding to other component carriers (CCs) maybe configured as another group. Herein, the primary component carriermay correspond to a component carrier having a most significant index ora least significant index, or may correspond to a predetermined index.Alternatively, a component carrier having a most favorable channelstatus or having a least favorable channel status may also be configuredas the primary component carrier. Furthermore, a component carrierhaving a largest bit size or a smallest bit size of the information datamay be configured as the primary component carrier. And, in the aspectsof coding rates and modulation orders, the primary component carrier maybe configured by using the same method.

2) Coding Chain when Applying the Dual RM Coding Scheme

(1) Hereinafter, a method for calculating a number of resource elementsfor allocating coded information data, when applying the dual RM codingscheme, will now be defined. When calculating the number of resourceelements, the present invention proposes a method of calculating thenumber of resource elements by using Equation 1 and Equation 2, basedupon the bit size of the whole information data, instead of the bit sizeof the information data being divided into a plurality of groups. Morespecifically, when the ACK/NACK and the RI are coded by using the dualRM coding scheme, the number of resource elements being allocated toeach RM codeword is allocated by equally the number of resourceelements, which is calculated from the given bit size O of the wholeinformation data.

Accordingly, when the number of resource elements V calculated from thegiven bit size O of the whole information data corresponds to an evennumber, Q′/2 number of resource elements may be allocated to eachcodeword, each codeword being generated in accordance with the dual RMcoding scheme.

Also, when the number of resource elements Q′ calculated from the givenbit size O of the whole information data corresponds to an odd number,(Q′+1)/2 number of resource elements may be allocated to a 1^(st)codeword, which is generated in accordance with the dual RM codingscheme, and (Q′−1)/2 number of resource elements may be allocated to a2^(nd) codeword, which is also generated in accordance with the dual RMcoding scheme. Alternatively, (Q′−1)/2 number of resource elements maybe allocated to a 1^(st) codeword, and (Q′+1)/2 number of resourceelements may be allocated to a 2^(nd) codeword.

(2) However, in the rate matching step using Equation 4, rate matching,i.e., puncturing may be individually performed on each codeword, eachcodeword being generated in accordance with the dual RM coding scheme,while matching the number and modulation order of the resource elements,wherein the resource elements are allocated to each codeword asdescribed in 2).

(3) FIG. 20 illustrates a coding chain for dual RM coding according tothe second embodiment of the present invention.

Referring to FIG. 20, the coding chain for the dual RM coding accordingto the present invention may be recapitulated as a method of performingthe dual RM coding scheme, which is proposed in the present invention,wherein a single resource element calculation is combined withindividual rate matching processes.

More specifically, in case the information data size of the ACK/NACK andthe RI is equal to or greater than 12 bits, the dual (32,0) RM codingscheme of the present invention may be applied, and, as described in 1),the whole information data may be grouped and divided into first(1^(st)) information data and second (2^(nd)) information data.

Subsequently, as described in (1) of 2), when calculating the number ofresource elements that are to be allocated, the corresponding number ofresource elements may be calculated based upon the bit size of the wholeinformation data, instead of the bit size of the information data beingdivided into a plurality of groups. Then, the calculated number ofresource elements is distributed to each RM encoder. Afterwards, ratematching may be performed on the codewords outputted from each encoder,in accordance with the given resource size. Thereafter, the processeddata may be concatenated. Furthermore, although an interleaver may beapplied to the concatenated data, the interleaver may be omitted in somecases.

3) Method for Deciding the Minimum Number of Resource Elements whenApplying the Dual RM Coding Scheme

Meanwhile, as described in the first embodiment of the presentinvention, in the dual RM coding scheme, a minimum value is alsorequired to be configured in the number of resource elements beingallocated to the UCI, i.e., the ACK/NACK or RI. Therefore, in the dualRM coding scheme according to the present invention, the minimum valuefor the number of resource elements being allocated to the ACK/NACK andthe RI may be configured by adding the minimum number of resourceelements corresponding to each of the grouped information data bits.

More specifically, if the equations for calculating the minimum numberof resource elements respective to O bits of the information data, i.e.,Equation 5 to Equation 7 are referred to as f(O) for simplicity, theequation for calculating the minimum number of resource elements thatare to be allocated to each codeword, during the dual RM coding process,may correspond to f(O/2). And, the minimum number of resource elementsthat are allocated to the whole (or entire) ACK/NACK and RI maycorrespond to f(O/2)+f(O/2). As a simple example, the minimum number ofresource elements that are allocated to the 12-bit sized informationdata corresponds to f(6)+f(6), instead of f(12).

Meanwhile, in case the size of the information data corresponds to anodd number, the size of each information data group that is used forcalculating the minimum number of resource elements may be allocatedwith (O+1)/2 bits for the first codeword and may be allocated with(O−1)/2 bits for the second codeword. Alternatively, the minimum numberof resource elements may be allocated with (O−1)/2 bits for the firstcodeword and may be allocated with (O+1)/2 bits for the second codeword.In this case, the minimum number of resource elements being allocated tothe whole ACK/NACK and RI corresponds to f((O+1)/2)+f((O−1)/2) Forexample, the minimum number of resource elements being calculated forthe 13-bit information data corresponds to f(7)+f(6), instead of f(13)

Therefore, Equation 7 may be changed to Equation 12 and Equation 13shown below.

$\begin{matrix}{{Q_{\min}^{\prime} = {{2 \times \lceil \frac{2 \times \frac{O}{2}}{Q_{m}} \rceil} = {2 \times \lceil \frac{O}{Q_{m}} \rceil}}}( {{wherein}\mspace{14mu} O\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{even}\mspace{14mu}{number}} )} & \lbrack {{Equation}\mspace{14mu} 12} \rbrack \\{{Q_{\min}^{\prime} = {{\lceil \frac{2 \times \frac{O + 1}{2}}{Q_{m}} \rceil + \lceil \frac{2 \times \frac{O - 1}{2}}{Q_{m}} \rceil} = {\lceil \frac{O + 1}{Q_{m}} \rceil + \lceil \frac{O - 1}{Q_{m}} \rceil}}}( {{wherein}\mspace{14mu} O\mspace{14mu}{is}\mspace{14mu}{an}\mspace{14mu}{odd}\mspace{14mu}{number}} )} & \lbrack {{Equation}\mspace{14mu} 13} \rbrack\end{matrix}$

A combination of Equation 12 and Equation 13 may be expressed asEquation 14 shown below.

$\begin{matrix}{Q_{\min}^{\prime} = {{\lceil \frac{2 \times \lceil {O/2} \rceil}{Q_{m}} \rceil + \lceil \frac{2 \times ( {O - \lceil {O/2} \rceil} )}{Q_{m}} \rceil} = {\lceil \frac{2 \times \lceil {O/2} \rceil}{Q_{m}} \rceil + \lceil \frac{2 \times \lfloor \frac{O}{2} \rfloor}{Q_{m}} \rceil}}} & \lbrack {{Equation}\mspace{14mu} 14} \rbrack\end{matrix}$

If the whole information data are divided into N number of groups sothat the RM coding scheme can be individually applied, and if the sizeof the information data being inputted during each RM coding process isreferred to as O_(i), the minimum number of resource elements beingallocated to the ACK/NACK and the RI corresponds to

$\sum\limits_{i = 0}^{N - 1}{{f( O_{i} )}.}$

Meanwhile, among the modulation orders of the transmission block,wherein the PUSCH transmission is performed, Q_(m) may correspond to alower modulation order. More specifically, when the modulation order ofthe first transmission block (TB) is QPSK, and when the modulation orderof the second TB is 16QAM, Q_(m) is equal to 2, which corresponds to aQPSK value respective to the lower modulation order among the modulationorders of two transmission blocks. Alternatively, Q_(m) may correspondto an average value of the modulation order values of the transmissionblock, wherein the PUSCH transmission is performed. More specifically,when the modulation order of the first transmission block (TB) is QPSK,and when the modulation order of the second TB is 16QAM, Q_(m) is equalto 3, which corresponds to the average value of the modulation orders ofthe two transmission blocks. Furthermore, among the modulation orders ofthe transmission block, wherein the PUSCH transmission is performed,Q_(m) may correspond to a higher modulation order. More specifically,when the modulation order of the first transmission block (TB) is QPSK,and when the modulation order of the second TB is 16QAM, Q_(m) is equalto 4, which corresponds to a 16QAM value respective to the highermodulation order among the modulation orders of two transmission blocks.

<Third Embodiment—Method of Mapping Coded Information Data to theResource Elements>

When mapping the coded UCI to the PUSCH according to the firstembodiment and the second embodiment of the present invention, each ofthe coded codewords may be mapped to one resource element or to aspecific number of resource elements by a virtual carrier order.

When performing sequential mapping, the coded codeword is mapped from aleast significant (or lowest) index of the virtual subcarrier in anincreasing direction of the index. For example, when performing dual RMcoding, the first codeword may be mapped starting from an odd-numberedvirtual subcarrier of the least significant index to each odd-numberedvirtual subcarrier. And, the second codeword may be mapped starting froman even-numbered virtual subcarrier of the least significant index toeach even-numbered virtual subcarrier.

Additionally, a mapping method may also be performed in a time-basedorder. For example, when the allocated resource elements correspond tothe 2^(nd), 4^(th), 9^(th), and 11^(th) symbols, respectively, the firstcodeword may be mapped to the 2^(nd) and 9^(th) symbols, and the secondcodeword may be mapped to the 4^(th) and 11^(th) symbols. Alternatively,the first codeword may be mapped to resource elements corresponding totwo symbols, and the second codeword may be mapped to resource elementscorresponding to the remaining symbols.

FIG. 21 illustrates a block view showing a structure of a communicationapparatus according to an embodiment of the present invention.

Referring to FIG. 21, a communication apparatus 2100 includes aprocessor 2110, a memory 2120, an RF module 2130, a display module 2140,and a user interface module 2150.

The communication apparatus 2100 is an exemplary illustration providedto simplify the description of the present invention. Also, thecommunication apparatus 2100 may further include necessary modules.Also, in the communication apparatus 2100 some of the modules may bedivided into more segmented modules. Referring to FIG. 21, an example ofthe processor 2110 is configured to perform operations according to theembodiment of the present invention. More specifically, for the detailedoperations of the processor 2110, reference may be made to thedescription of the present invention shown in FIG. 1 to FIG. 20.

The memory 2120 is connected to the processor 2110 and stores operatingsystems, applications, program codes, data, and so on. The RF module2130 is connected to the processor 2110 and performs a function ofconverting baseband signals to radio (or wireless) signals or convertingradio signals to baseband signals. In order to do so, the RF module 2130performs analog conversion, amplification, filtering, and frequencyuplink conversion or inverse processes of the same. The display module2140 is connected to the processor 2110 and displays diverseinformation. The display module 2140 will not be limited only to theexample given herein. In other words, generally known elements, such asLiquid Crystal Display (LCD), Light Emitting Diode (LED), Organic LightEmitting Diode (OLED) may also be used as the display module 2140. Theuser interface module 2150 is connected to the processor 2110, and theuser interface module 2150 may be configured of a combination ofgenerally known user interfaces, such as keypads, touchscreens, and soon.

The above-described embodiments of the present invention correspond topredetermined combinations of elements and features and characteristicsof the present invention. Moreover, unless mentioned otherwise, thecharacteristics of the present invention may be considered as optionalfeatures of the present invention. Herein, each element orcharacteristic of the present invention may also be operated orperformed without being combined with other elements or characteristicsof the present invention. Alternatively, the embodiment of the presentinvention may be realized by combining some of the elements and/orcharacteristics of the present invention. Additionally, the order ofoperations described according to the embodiment of the presentinvention may be varied. Furthermore, part of the configuration orcharacteristics of any one specific embodiment of the present inventionmay also be included in (or shared by) another embodiment of the presentinvention, or part of the configuration or characteristics of any oneembodiment of the present invention may replace the respectiveconfiguration or characteristics of another embodiment of the presentinvention. Furthermore, it is apparent that claims that do not have anyexplicit citations within the scope of the claims of the presentinvention may either be combined to configure another embodiment of thepresent invention, or new claims may be added during the amendment ofthe present invention after the filing for the patent application of thepresent invention.

In the description of the present invention, the embodiments of thepresent invention have been described by mainly focusing on the datatransmission and reception relation between the base station and theterminal (or user equipment). Occasionally, in the description of thepresent invention, particular operations of the present invention thatare described as being performed by the base station may also beperformed by an upper node of the base station. More specifically, in anetwork consisting of multiple network nodes including the base station,it is apparent that diverse operations that are performed in order tocommunicate with the terminal may be performed by the base station or bnetwork nodes other than the base station. Herein, the term ‘BaseStation (BS)’ may be replaced by other terms, such as fixed station,Node B, eNode B (eNB), Access Point (AP), and so on.

The above-described embodiments of the present invention may beimplemented by using a variety of methods. For example, the embodimentsof the present invention may be implemented in the form of hardware,firmware, or software, or in a combination of hardware, firmware, and/orsoftware.

In case of implementing the embodiments of the present invention in theform of hardware, the method according to the embodiments of the presentinvention may be implemented by using at least one of ApplicationSpecific Integrated Circuits (ASICs), Digital Signal Processors (DSPs),Digital Signal Processing Devices (DSPDs), Programmable Logic Devices(PLDs), Field Programmable Gate Arrays (FPGAs), processors, controllers,micro controllers, micro processors, and so on.

In case of implementing the embodiments of the present invention in theform of firmware or software, the method according to the embodiments ofthe present invention may be implemented in the form of a module,procedure, or function performing the above-described functions oroperations. A software code may be stored in a memory unit and driven bya processor. Herein, the memory unit may be located inside or outside ofthe processor, and the memory unit may transmit and receive data to andfrom the processor by using a wide range of methods that have alreadybeen disclosed.

As described above, the method for transmitting control information inwireless communication system and apparatus therefore according to thepresent invention are advantageous in that, in a wireless communicationsystem, a transmitting end may effectively encode the controlinformation according to the present invention. Also, the method fortransmitting control information in wireless communication system andapparatus therefore according to the present invention may be applied towireless communication systems. Most particularly, the present inventionmay be applied to wireless mobile communication apparatuses that areused for cellular systems.

The present invention may be realized in another concrete configuration(or formation) without deviating from the scope and spirit of theessential characteristics of the present invention. Therefore, in allaspect, the detailed description of present invention is intended to beunderstood and interpreted as an exemplary embodiment of the presentinvention without limitation. The scope of the present invention shallbe decided based upon a reasonable interpretation of the appended claimsof the present invention and shall come within the scope of the appendedclaims and their equivalents.

Therefore, it will be apparent to those skilled in the art that variousmodifications and variations can be made in the present inventionwithout departing from the spirit or scope of the inventions. Thus, itis intended that the present invention covers the modifications andvariations of this invention provided they come within the scope of theappended claims and their equivalents.

What is claimed is:
 1. A method for transmitting information data byusing an RM (Reed-Muller) coding scheme in a wireless communicationsystem, the method comprising: determining a number of resource elementsfor transmitting the information data; dividing the information datainto first information data and second information data if a bit size Oof the information data is equal to or larger than a predeterminednumber; applying RM coding to each of the first information data and thesecond information data; concatenating the coded first information dataand the coded second information data, and transmitting the concatenatedfirst and second information data by using the determined number ofresource elements, wherein a minimum value Q′_(min) for the number ofresource elements is defined by a sum of a minimum value Q′_(min) _(—) ₂for the number of resource elements corresponding to the firstinformation data and a minimum value Q′_(min) _(—) ₂ for the number ofresource elements corresponding to the second information data, wherein^(Q′) _(min) _(—) ₁ and Q′_(min) _(—) ₂ are defined by using thefollowing Equation: $\begin{matrix}{{Q_{{\min\_}1}^{\prime} = {{\lceil \frac{2 \times \lceil \frac{O}{2} \rceil}{Q_{m}} \rceil\mspace{14mu}{and}\mspace{14mu} Q_{{\min\_}2}^{\prime}} = {\lceil \frac{2 \times ( {O - \lceil \frac{O}{2} \rceil} )}{Q_{m}} \rceil = \lceil \frac{2 \times \lfloor \frac{O}{2} \rfloor}{Q_{m}} \rceil}}},} & \langle {Equation} \rangle\end{matrix}$ where Q_(m) indicates a bit size per symbol according to amodulation order.
 2. The method of claim 1, wherein: the informationdata corresponds to UCI (Uplink Control Information) that is transmittedthrough a Physical Uplink Shared Channel (PUSCH).
 3. The method of claim1, wherein the predetermined number corresponds to 12 bits.
 4. Atransmitting apparatus of a wireless communication system, thetransmitting apparatus comprising: a processor configured to: determinea number of resource elements for transmitting information data, dividethe information data to first information data and second informationdata if a bit size O of the information data is equal to or larger thana predetermined number, apply RM coding to each of the first informationdata and the second information data, and concatenate the coded firstinformation data and the coded second information data; and atransmission module configured to transmit the concatenated first andsecond information data by using the determined number of resourceelements, wherein a minimum value Q′_(min) for the number of resourceelements is defined by a sum of a minimum value Q′_(min) _(—) ₁ for thenumber of resource elements corresponding to the first information dataand a minimum value Q′_(min) _(—) ₂ for the number of resource elementscorresponding to the second information data, wherein Q′_(min) _(—) ₁and Q′_(min) _(—) ₂ are defined by using the following Equation:$\begin{matrix}{{Q_{{\min\_}1}^{\prime} = {{\lceil \frac{2 \times \lceil \frac{O}{2} \rceil}{Q_{m}} \rceil\mspace{14mu}{and}\mspace{14mu} Q_{{\min\_}2}^{\prime}} = {\lceil \frac{2 \times ( {O - \lceil \frac{O}{2} \rceil} )}{Q_{m}} \rceil = \lceil \frac{2 \times \lfloor \frac{O}{2} \rfloor}{Q_{m}} \rceil}}},} & \langle {Equation} \rangle\end{matrix}$ where Q_(m) indicates a bit size per symbol according to amodulation order.
 5. The transmitting apparatus of claim 4, wherein: theinformation data corresponds to UCI (Uplink Control Information) that istransmitted through a Physical Uplink Shared Channel (PUSCH).
 6. Thetransmitting apparatus of claim 4, wherein the predetermined numbercorresponds to 12 bits.